A novel conflict-free parallel memory access scheme for FFT constant geometry architectures
نویسندگان
چکیده
منابع مشابه
A Portable 3D FFT Package for Distributed-Memory Parallel Architectures
1 I n t r o d u c t i o n Multidimensional FF’I’s are used frequently in engineerillg and scientific calculations, especially in image processing. Parallel implementations of FFT generally follow two approaches. One is the binary-exchange approach[l ,2], where data exchanges take place in all pairs of processors with processor numbers differing by one bit. Another one is the transpose approach[...
متن کاملConflict-free star-access in parallel memory systems
We study conflict-free data distribution schemes in parallel memories in multiprocessor system architectures. Given a host graph G, the problem is to map the nodes of G into memory modules such that any instance of a template type T in G can be accessed without memory conflicts. A conflict occurs if two or more nodes of T are mapped to the same memory module. The mapping algorithm should (i) be...
متن کاملCellFlow: A Parallel Rendering Scheme for Distributed Memory Architectures
CellFlow is an animation system that exploits frame coherency to implement a lookahead scheme of object dataflow. The implementation of this scheme uses the communication features of modern scalable multicomputers to achieve good speedup by means of latency hiding. We demonstrate the performance of our approach in the field of volume rendering by implementing incremental rotation of the volumet...
متن کاملA Parallel-Pipelined Constant Geometry Algorithm (PCGA) for Computation of FFT on a Special Processor
In digital signal processing applications, we usually use DFT (discrete Fourier transform) to transfer signal from time-domain to frequency-domain. In past decades, there were many papers discussing and exploiting FFT (fast Fourier transform) architectures for hardware implementation. In this paper, we proposed a novel VLSI FFT processor based on parallel-pipelined constant geometry algorithm (...
متن کاملFinite Projective Geometry based Fast, Conflict-free Parallel Matrix Computations
Matrix computations, especially iterative PDE solving (and the sparse matrix vector multiplication subproblem within) using conjugate gradient algorithm, and LU/Cholesky decomposition for solving system of linear equations, form the kernel of many applications, such as circuit simulators, computational fluid dynamics or structural analysis etc. The problem of designing approaches for paralleliz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2013
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-013-4826-5